A Note on a Binary Relation Corresponding to a Bipartite Graph
نویسندگان
چکیده
منابع مشابه
A Note on a graph associated to a commutative ring
The rings considered in this article are commutative with identity. This article is motivated by the work on comaximal graphs of rings. In this article, with any ring $R$, we associate an undirected graph denoted by $G(R)$, whose vertex set is the set of all elements of $R$ and distinct vertices $x,y$ are joined by an edge in $G(R)$ if and only if $Rxcap Ry = Rxy$. In Section 2 of this articl...
متن کاملA note on a graph related to the comaximal ideal graph of a commutative ring
The rings considered in this article are commutative with identity which admit at least two maximal ideals. This article is inspired by the work done on the comaximal ideal graph of a commutative ring. Let R be a ring. We associate an undirected graph to R denoted by mathcal{G}(R), whose vertex set is the set of all proper ideals I of R such that Inotsubseteq J(R), where J(R) is...
متن کاملA Note on Bipartite Graph Tiling
Bipartite graph tiling was studied by Zhao [7] who gave the best possible minimum degree conditions for a balanced bipartite graph on 2ms vertices to contain m vertex disjoint copies of Ks,s. Let s < t be fixed positive integers. Hladký and Schacht [3] gave minimum degree conditions for a balanced bipartite graph on 2m(s + t) vertices to contain m vertex disjoint copies of Ks,t. Their results w...
متن کاملA note on the order graph of a group
The order graph of a group $G$, denoted by $Gamma^*(G)$, is a graph whose vertices are subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $|H|big{|}|K|$ or $|K|big{|}|H|$. In this paper, we study the connectivity and diameter of this graph. Also we give a relation between the order graph and prime graph of a group.
متن کاملNote on Bipartite Graph Tilings
Let s < t be two fixed positive integers. We determine sufficient minimum degree conditions for a bipartite graph G, with both color classes of size n = k(s + t), which ensure that G has a Ks,t-factor. Our result extends the work of Zhao, who determined the minimum degree threshold which guarantees that a bipartite graph has a Ks,s-factor.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ITM Web of Conferences
سال: 2018
ISSN: 2271-2097
DOI: 10.1051/itmconf/20182201039